Dynamical sampling on finite index sets
نویسندگان
چکیده
منابع مشابه
On sampling generating sets of finite groups
The problem of determining the structure of Nk(G) is of interest in several contexts. The counting problem goes back to Philip Hall, who expressed Nk(G) as a Möbius type summation of Nk(H) over all maximal subgroups H ⊂ G (see [23]). Recently the counting problem has been studied for large simple groups where remarkable progress has been made (see [25, 27]). In this paper we analyze Nk for solv...
متن کاملTransport in time-dependent dynamical systems: finite-time coherent sets.
We study the transport properties of nonautonomous chaotic dynamical systems over a finite-time duration. We are particularly interested in those regions that remain coherent and relatively nondispersive over finite periods of time, despite the chaotic nature of the system. We develop a novel probabilistic methodology based upon transfer operators that automatically detect maximally coherent se...
متن کاملOn Approximating Optimal Sampling Laws for Stochastically Constrained Simulation Optimization on Large Finite Sets
Nugroho Artadi Pujowidianto Department of Industrial and Systems Engineering, National University of Singapore, SINGAPORE, [email protected] Susan R. Hunter School of Operations Research and Information Engineering, Cornell University, Ithaca, NY 14853, USA, [email protected] Raghu Pasupathy The Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA 24061, USA, ...
متن کاملDesigning different Sampling Plans Based on Process Capability Index
Acceptance sampling plan is a method to make decision on either accepting or rejecting a specific lot or more generally to inspect the quality of products that can be used by different methods. Along with this, one suitable measure to improve manufacturing processes is to analyze process capability indices. These indices have many applications in production environments. In this paper, a repeti...
متن کاملIndex sets for Finite Normal Predicate Logic Programs
Let L be a computable first order predicate language with infinitely many constant symbols and infinitely many n-ary predicate symbols and n-ary functions symbols for all n ≥ 1 and let Q0, Q1, . . . be an effective list all the finite normal predicate logic programs over L. Given some property P of finite normal predicate logic programs over L, we define the index set IP to be the set of indice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal d'Analyse Mathématique
سال: 2020
ISSN: 0021-7670,1565-8538
DOI: 10.1007/s11854-020-0099-2